Random Generation of Deterministic Acyclic Automata Using Markov Chains
نویسندگان
چکیده
In this article we propose an algorithm, based on Markov chain techniques, to generate random automata that are deterministic, accessible and acyclic. The distribution of the output approaches the uniform distribution on n-state such automata. We then show how to adapt this algorithm in order to generate minimal acyclic automata with n states almost uniformly.
منابع مشابه
Sampling different kinds of acyclic automata using Markov chains
We propose algorithms that use Markov chain techniques to generate acyclic automata uniformly at random. We first consider deterministic, accessible and acyclic automata, then focus on the class of minimal acyclic automata. In each case we explain how to define random local transformations that describe an ergodic and symmetric Markov chain: the distribution of the automaton obtained after T ra...
متن کاملRandom Generation of Deterministic Acyclic Automata Using the Recursive Method
In this article, we propose a uniform random generator for accessible deterministic acyclic automata with n states, which is based on the recursive method. The generator has a preprocessing that requires O(n) arithmetic operations, and, once it is done, can generate acyclic automata using O(n) arithmetic operations for each sample. We also propose a lazy version of the algorithm that takes adva...
متن کاملExact Generation of Acyclic Deterministic Finite Automata
We give a canonical representation for trim acyclic deterministic finite automata (ADFA) with n states over an alphabet of k symbols. Using this normal form, we present a backtracking algorithm for the exact generation of ADFAs. This algorithm is a non trivial adaptation of the algorithm for the exact generation of minimal acyclic deterministic finite automata (MADFA), presented by Almeida et al..
متن کاملExact Generation of Minimal Acyclic Deterministic Finite Automata
We give a canonical representation for minimal acyclic deterministic finite automata (MADFA) with n states over an alphabet of k symbols. Using this normal form, we present a method for the exact generation of MADFAs. This method avoids a rejection phase, that would be needed if a generation algorithm for a larger class of objects that contains the MADFAs were used. We give an upper bound for M...
متن کاملPattern Markov Chains: Optimal Markov Chain Embedding through Deterministic Finite Automata
In the framework of patterns in random texts, the Markov chain embedding techniques consist of turning the occurrences of a pattern over an order-m Markov sequence into those of a subset of states into an order-1 Markov chain. In this paper we use the theory of language and automata to provide space-optimal Markov chain embedding using the new notion of pattern Markov chains (PMCs), and we give...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011